Can the Discretization Modify the Performance of Schwarz Methods?
نویسندگان
چکیده
Schwarz domain decomposition methods can be analyzed both at the continuous and discrete level. For consistent discretizations, one would naturally expect that the discretized method performs as predicted by the continuous analysis. We show in this short note for two model problems that this is not always the case, and that the discretization can both increase and decrease the convergence speed predicted by the continuous analysis.
منابع مشابه
An Evolutionary Multi-objective Discretization based on Normalized Cut
Learning models and related results depend on the quality of the input data. If raw data is not properly cleaned and structured, the results are tending to be incorrect. Therefore, discretization as one of the preprocessing techniques plays an important role in learning processes. The most important challenge in the discretization process is to reduce the number of features’ values. This operat...
متن کاملOptimized Schwarz Methods for Maxwell equations
Over the last two decades, classical Schwarz methods have been extended to systems of hyperbolic partial differential equations, using characteristic transmission conditions, and it has been observed that the classical Schwarz method can be convergent even without overlap in certain cases. This is in strong contrast to the behavior of classical Schwarz methods applied to elliptic problems, for ...
متن کاملOptimized Schwarz Methods for Maxwell's Equations
Over the last two decades, classical Schwarz methods have been extended to systems of hyperbolic partial differential equations, using characteristic transmission conditions, and it has been observed that the classical Schwarz method can be convergent even without overlap in certain cases. This is in strong contrast to the behavior of classical Schwarz methods applied to elliptic problems, for ...
متن کاملOptimized Schwarz methods in spherical geometry with an overset grid system
In recent years, much attention has been given to domain decomposition methods for solving linear elliptic problems that are based on a partitioning of the domain of the physical problem. More recently, a new class of Schwarz methods known as optimized Schwarz methods was introduced to improve the performance of the classical Schwarz methods. In this paper, we investigate the performance of thi...
متن کاملGlobalized Newton-Krylov-Schwarz Algorithms and Software for Parallel Implicit CFD
Implicit solution methods are important in applications modeled by PDEs with disparate temporal and spatial scales. Because such applications require high resolution with reasonable turnaround, parallelization is essential. The pseudo-transient matrix-free Newton-Krylov-Schwarz (ΨNKS) algorithmic framework is presented as a widely applicable answer. This article shows that, for the classical pr...
متن کامل